翻訳と辞書 |
Hilbert curve scheduling : ウィキペディア英語版 | Hilbert curve scheduling In parallel processing, the Hilbert curve scheduling method turns a multidimensional task allocation problem into a one-dimensional space filling problem using Hilbert curves, assigning related tasks to locations with higher levels of proximity.〔''Scheduling for Parallel Processing'' by Maciej Drozdowski 2009 ISBN 1-84882-309-6 page 166〕 Other space filling curves may also be used in various computing applications for similar purposes.〔 The SLURM job scheduler which is used on a number of supercomputers uses a best fit algorithm based on Hilbert curve scheduling in order to optimize locality of task assignments.〔''Job Scheduling Strategies for Parallel Processing:'' by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 ISBN 3-642-04632-0 pages 138-144〕 ==See also==
* Job scheduling * Supercomputer operating systems
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Hilbert curve scheduling」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|